Routing in Mobile Opportunistic Social Networks with Selfish Nodes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selfish Routing in Social Networks

I investigate the intersection of selfish routing and the preferential attachment social network. In particular, through the use of a stochastic generative preferential attachment model, a collection abstract network patterns are created for the transfer of flow from one distinct source destination vertex pair. Then, using a linear approximation method, I calculate both Nash and system optimal ...

متن کامل

A Service-Based Selfish Routing for Mobile Social Networks

Rights © 2015 Lingfei Yu and Pengfei Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Routing in mobile social networks is a challenging task due to the characteristic of intermittent connectivity, especially when the nodes be...

متن کامل

Performance Evaluation of Mobile Ad Hoc Networks Using Routing with Selfish Nodes

In mobile ad hoc networks (MANETs)[1], a mobile station (MS) can communicate with nodes outside of its transmission range by employing intermediate nodes as relays. To find a path to a specific destination node, the source node broadcasts route request packets that are forwarded to all other nodes. A simple flooding scheme is employed in AODV [2], where every node rebroadcasts these route reque...

متن کامل

SPRINT-SELF: Social-Based Routing and Selfish Node Detection in Opportunistic Networks

Since mobile devices nowadays have become ubiquitous, several types of networks formed over such devices have been proposed. One such approach is represented by opportunistic networking, which is based on a store-carry-and-forward paradigm, where nodes store data and carry it until they reach a suitable node for forwarding. The problem in such networks is how to decide what the next hop will be...

متن کامل

A game-theoretic incentive scheme for social-aware routing in selfish mobile social networks

Cooperative data forwarding can improve the performance of data routing in Mobile Social Networks (MSNs). However, previous studies mainly assumed that mobile nodes show selfish behaviors in data relaying merely due to their limited device resources. Nevertheless, the observation of everyday experience infers that they mitigate their selfishness based on their social relationships and content k...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Wireless Communications and Mobile Computing

سال: 2019

ISSN: 1530-8669,1530-8677

DOI: 10.1155/2019/6359806